P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
131	Disjoint NP-Pairs Christian Glaßer 1 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-02-17 11:57:27 Complexity classes P versus NP problem NP-complete NP Oracle machine PP P Many-one reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics
132	Optimal acceptors and optimal proof systems Edward A. Hirsch? Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St. Petersburg[removed], Russia http://logic.pdmi.ras.ru/~hirsch/ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2010-03-28 09:40:37 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem Propositional proof system PP Mathematical proof Theoretical computer science Computational complexity theory Applied mathematics
133	On an optimal randomized acceptor for graph nonisomorphism∗ Edward A. Hirsch†,‡ Dmitry Itsykson† November 9, 2011 Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-11-09 06:46:56 Analysis of algorithms Mathematical optimization Complexity classes Graph coloring NP-complete Randomized algorithm P versus NP problem NP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
134	Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:46:04 Graph theory NP-complete problems Complexity classes Morphisms Graph coloring Graph homomorphism Matching P versus NP problem Vertex cover Theoretical computer science Mathematics Computational complexity theory
135	Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2007-09-05 18:26:13 NP-complete problems Complexity classes Holographic algorithm NP-complete Matching FKT algorithm NP-hard P versus NP problem NP Theoretical computer science Computational complexity theory Mathematics
136	FRENCH GUIANA ARIANE LAUNCH Add to Reading List Source URL: www.lomont.org Language: English - Date: 2012-08-09 18:48:30 Digital signal processing Information theory Binary arithmetic Binary numeral system Elementary arithmetic Fourier analysis P versus NP problem Nyquist–Shannon sampling theorem Sampling Mathematics Theoretical computer science Applied mathematics
137	Invitation to Complexity Theory Complexity theory provides new viewpoints on various phenomena that were once considered by past thinkers. By Oded Goldreich DOI: [removed][removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2013-03-27 12:14:10 Probabilistic complexity theory Mathematical optimization Computational complexity theory Structural complexity theory Complexity Average-case complexity P versus NP problem NP-complete Pseudorandom generator Theoretical computer science Applied mathematics Complexity classes
138	Chapter 6 Quantum Computation 6.1 Classical Circuits Add to Reading List Source URL: www.theory.caltech.edu Language: English - Date: 2009-07-16 20:16:32 Complexity classes Mathematical optimization Models of computation Quantum information science P versus NP problem NP P Quantum circuit Quantum computer Theoretical computer science Computational complexity theory Applied mathematics
139	Lecture Notes for Ph219/CS219: Quantum Information and Computation Chapter 5 John Preskill California Institute of Technology November, 2013 Add to Reading List Source URL: www.theory.caltech.edu Language: English - Date: 2013-11-14 21:06:14 Complexity classes Quantum information science Mathematical optimization Models of computation P versus NP problem Boolean circuit Circuit complexity P Quantum circuit Theoretical computer science Applied mathematics Computational complexity theory
140	Reprints This copy is for your personal, noncommercial use only. You can order presentation-ready copies for distribution to your colleagues, clients or customers here or use the "Reprints" tool that appears next to any Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2010-09-17 12:45:52 Mathematics Millennium Prize Problems Mathematical optimization Conjectures P versus NP problem Structural complexity theory NP Stephen Cook PH Theoretical computer science Complexity classes Applied mathematics

UPDATE